Sleep as the solution to an optimization problem

نویسنده

  • Emmanuel Tannenbaum
چکیده

This paper develops a highly simplified model with which to analyze the phenomenon of sleep. Motivated by Crick’s suggestion that sleep is the brain’s way of “taking out the trash,” a suggestion that is supported by emerging evidence, we consider the problem of the filling and emptying of a tank. At any given time, the tank may take in external resource, or fill, if resource is available at that time, or it may empty. The filling phases correspond to information input from the environment, or input of some material in general, while the emptying phases correspond to processing of the resource. Given a resource-availablility profile over some time interval T , we develop a canonical algorithm for determining the fill-empty profile that produces the maximum quantity of processed resource at the end of the time interval. From this algorithm, it readily follows that for a periodically oscillating resource-availability profile, the optimal fill-empty strategy is given by a fill period when resource is available, followed by an empty period when resource is not. This cycling behavior is analogous to the wake-sleep cycles in organismal life, where the generally nocturnal sleep phase is a period where the information collected from the day’s activities may be processed. The sleep cycle is then a mechanism for the organism to process a maximal amount of information over a daily cycle. Our model can exhibit phenomena analogous to “microsleeps,” and other behavior associated with breakdown in sleep patterns.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bi-objective optimization of multi-server intermodal hub-location-allocation problem in congested systems: modeling and solution

A new multi-objective intermodal hub-location-allocation problem is modeled in this paper in which both the origin and the destination hub facilities are modeled as an M/M/m queuing system. The problem is being formulated as a constrained bi-objective optimization model to minimize the total costs as well as minimizing the total system time. A small-size problem is solved on the GAMS software t...

متن کامل

An interactive weighted fuzzy goal programming technique to solve multi-objective reliability optimization problem

This paper presents an application of interactive fuzzy goal programming to the nonlinear multi-objective reliability optimization problem considering system reliability and cost of the system as objective functions. As the decision maker always have an intention to produce highly reliable system with minimum cost, therefore, we introduce the interactive method to design a high productivity sys...

متن کامل

A Novel Approach for Optimization of Transportation Problem in Chaos Environment

    Nature is characterized by its chaotic behavior. Mathematics is considered one of the appropriate tools to achieve the best definition of possible its chaos variables and process. Classical mathematics deals with the numbers as static and meaningless, but chaos mathematics deals with it as dynamic evolutionary, and value- added. This paper attempts to introduce the transportation problem re...

متن کامل

A Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains

Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006